强化学习的主要困难之一是从{\ em dobsolicy}样本中学习，这些样本是由算法评估（目标策略）的不同策略（行为策略）收集的。非政策学习需要从行为政策中纠正样本的分布到目标策略的分布。不幸的是，重要的抽样具有固有的高方差问题，从而导致策略梯度方法的梯度估计差。我们专注于范围的参与者 - 批评体系结构，并提出了一种称为预处理近端政策优化（P3O）的新方法，该方法可以通过将预处理程序应用于保守政策迭代（CPI）目标来控制重要性采样的较高差异。 {\ em此预处理以一种特殊的方式使用Sigmoid函数，即当没有策略更改时，梯度是最大的，因此策略梯度将驱动大参数更新以有效地探索参数空间}。这是一种新颖的探索方法，鉴于现有的探索方法是基于国家和行动的新颖性，尚未对其进行研究。我们与离散和连续任务上的几种表现最好的算法进行了比较，结果表明{\ em ppo不足以实现异位}，并且我们的p3O比ppo {\ em off-policy}比ppo比“根据off off ppo”。 - 通过Deon Metric衡量的Policyness，P3O在比PPO更大的政策空间中探索。结果还表明，在训练过程中，我们的P3O比PPO更好地提高了CPI目标。

基于模型的强化学习方法在许多任务中实现了显着的样本效率，但它们的性能通常受模型错误的存在限制。为减少模型错误，以前的作品使用单一设计的网络来符合整个环境动态，将环境动态视为黑匣子。然而，这些方法缺乏考虑动态可能包含多个子动态的环境分解性，这可以单独建模，允许我们更准确地构建世界模型。在本文中，我们提出了环境动态分解（ED2），这是一种以分解方式模拟环境的新型世界模型施工框架。 ED2包含两个关键组件：子动力学发现（SD2）和动态分解预测（D2P）。 SD2发现环境中的子动力学，然后D2P构建子动力学后的分解世界模型。 ED2可以容易地与现有的MBRL算法和经验结果表明，ED2显着降低了模型误差，并提高了各种任务上最先进的MBRL算法的性能。

开放的领域知识库非常重要。它通常是从百科全书网站中提取的，并广泛用于知识检索系统，问答系统或推荐系统。实际上，关键的挑战是保持最新的知识库。与从百科全书转储中获取所有数据的笨拙获取所有数据不同，可以在避免无效提取的同时扩大知识库的新鲜度，而当前的知识库更新方法通常确定是否需要通过构建预测模型来更新实体。但是，这些方法只能在某些特定字段中定义，由于数据源和数据结构的问题，结果证明是显而易见的偏差。对于开放域知识，用户的查询意图通常是多种多样的，因此我们构建了一个主题感知的图形网络，用于根据用户查询日志进行知识更新。我们的方法可以总结如下：1。通过用户的日志提取实体，然后选择它们作为种子2.刮擦百科全书网站中种子实体的属性，并为每个实体的自我监督构造实体属性图。 3.使用实体属性图来训练GNN实体更新模型，以确定是否需要同步该实体。 4.根据最小编辑时间算法，使用百科全书知识与知识库中的实体匹配和更新过滤的实体。

文本分类在许多实际应用中起着重要作用。在现实世界中，数据集非常小。大多数现有方法采用预训练的神经网络模型来处理这种数据集。但是，这些方法要么很难在移动设备上部署，因此它们的输出尺寸较大，或者无法完全提取短语和条款之间的深层语义信息。本文提出了一个基于多模型的深度学习框架，用于使用不平衡且极其小的数据集，用于短文本多类分类。我们的框架主要包括五层：编码器层使用Distilbert获得上下文敏感的动态词向量，这些词向量很难在传统的功能工程方法中表示。由于该层的变压器部分是蒸馏的，因此我们的框架被压缩。然后，我们使用接下来的两层提取深层语义信息。编码器层的输出发送到双向LSTM网络，并以单词和句子级别的LSTM层次提取特征矩阵，以获得细粒的语义表示。之后，最大式层将特征矩阵转换为较低维矩阵，仅保留明显的特征。最后，将特征矩阵视为完全连接的软磁层的输入，该输入包含一个可以将预测的线性向量转换为输出值的函数，作为每个分类中文本的概率。对两个公共基准测试的广泛实验证明了我们提出的方法对极小的数据集的有效性。它在精确，召回，准确性和F1得分方面保留最先进的基线性能，以及通过模型大小，训练时间和收敛时期，我们可以得出结论，可以更快，更轻松地部署我们的方法在移动设备上。

In this paper, we propose a robust 3D detector, named Cross Modal Transformer (CMT), for end-to-end 3D multi-modal detection. Without explicit view transformation, CMT takes the image and point clouds tokens as inputs and directly outputs accurate 3D bounding boxes. The spatial alignment of multi-modal tokens is performed implicitly, by encoding the 3D points into multi-modal features. The core design of CMT is quite simple while its performance is impressive. CMT obtains 73.0% NDS on nuScenes benchmark. Moreover, CMT has a strong robustness even if the LiDAR is missing. Code will be released at https://github.com/junjie18/CMT.

Given the increasingly intricate forms of partial differential equations (PDEs) in physics and related fields, computationally solving PDEs without analytic solutions inevitably suffers from the trade-off between accuracy and efficiency. Recent advances in neural operators, a kind of mesh-independent neural-network-based PDE solvers, have suggested the dawn of overcoming this challenge. In this emerging direction, Koopman neural operator (KNO) is a representative demonstration and outperforms other state-of-the-art alternatives in terms of accuracy and efficiency. Here we present KoopmanLab, a self-contained and user-friendly PyTorch module of the Koopman neural operator family for solving partial differential equations. Beyond the original version of KNO, we develop multiple new variants of KNO based on different neural network architectures to improve the general applicability of our module. These variants are validated by mesh-independent and long-term prediction experiments implemented on representative PDEs (e.g., the Navier-Stokes equation and the Bateman-Burgers equation) and ERA5 (i.e., one of the largest high-resolution data sets of global-scale climate fields). These demonstrations suggest the potential of KoopmanLab to be considered in diverse applications of partial differential equations.

Rankings are widely collected in various real-life scenarios, leading to the leakage of personal information such as users' preferences on videos or news. To protect rankings, existing works mainly develop privacy protection on a single ranking within a set of ranking or pairwise comparisons of a ranking under the $\epsilon$-differential privacy. This paper proposes a novel notion called $\epsilon$-ranking differential privacy for protecting ranks. We establish the connection between the Mallows model (Mallows, 1957) and the proposed $\epsilon$-ranking differential privacy. This allows us to develop a multistage ranking algorithm to generate synthetic rankings while satisfying the developed $\epsilon$-ranking differential privacy. Theoretical results regarding the utility of synthetic rankings in the downstream tasks, including the inference attack and the personalized ranking tasks, are established. For the inference attack, we quantify how $\epsilon$ affects the estimation of the true ranking based on synthetic rankings. For the personalized ranking task, we consider varying privacy preferences among users and quantify how their privacy preferences affect the consistency in estimating the optimal ranking function. Extensive numerical experiments are carried out to verify the theoretical results and demonstrate the effectiveness of the proposed synthetic ranking algorithm.

Due to their ability to offer more comprehensive information than data from a single view, multi-view (multi-source, multi-modal, multi-perspective, etc.) data are being used more frequently in remote sensing tasks. However, as the number of views grows, the issue of data quality becomes more apparent, limiting the potential benefits of multi-view data. Although recent deep neural network (DNN) based models can learn the weight of data adaptively, a lack of research on explicitly quantifying the data quality of each view when fusing them renders these models inexplicable, performing unsatisfactorily and inflexible in downstream remote sensing tasks. To fill this gap, in this paper, evidential deep learning is introduced to the task of aerial-ground dual-view remote sensing scene classification to model the credibility of each view. Specifically, the theory of evidence is used to calculate an uncertainty value which describes the decision-making risk of each view. Based on this uncertainty, a novel decision-level fusion strategy is proposed to ensure that the view with lower risk obtains more weight, making the classification more credible. On two well-known, publicly available datasets of aerial-ground dual-view remote sensing images, the proposed approach achieves state-of-the-art results, demonstrating its effectiveness. The code and datasets of this article are available at the following address: https://github.com/gaopiaoliang/Evidential.

A noisy training set usually leads to the degradation of the generalization and robustness of neural networks. In this paper, we propose a novel theoretically guaranteed clean sample selection framework for learning with noisy labels. Specifically, we first present a Scalable Penalized Regression (SPR) method, to model the linear relation between network features and one-hot labels. In SPR, the clean data are identified by the zero mean-shift parameters solved in the regression model. We theoretically show that SPR can recover clean data under some conditions. Under general scenarios, the conditions may be no longer satisfied; and some noisy data are falsely selected as clean data. To solve this problem, we propose a data-adaptive method for Scalable Penalized Regression with Knockoff filters (Knockoffs-SPR), which is provable to control the False-Selection-Rate (FSR) in the selected clean data. To improve the efficiency, we further present a split algorithm that divides the whole training set into small pieces that can be solved in parallel to make the framework scalable to large datasets. While Knockoffs-SPR can be regarded as a sample selection module for a standard supervised training pipeline, we further combine it with a semi-supervised algorithm to exploit the support of noisy data as unlabeled data. Experimental results on several benchmark datasets and real-world noisy datasets show the effectiveness of our framework and validate the theoretical results of Knockoffs-SPR. Our code and pre-trained models will be released.

Temporal sentence grounding (TSG) aims to identify the temporal boundary of a specific segment from an untrimmed video by a sentence query. All existing works first utilize a sparse sampling strategy to extract a fixed number of video frames and then conduct multi-modal interactions with query sentence for reasoning. However, we argue that these methods have overlooked two indispensable issues: 1) Boundary-bias: The annotated target segment generally refers to two specific frames as corresponding start and end timestamps. The video downsampling process may lose these two frames and take the adjacent irrelevant frames as new boundaries. 2) Reasoning-bias: Such incorrect new boundary frames also lead to the reasoning bias during frame-query interaction, reducing the generalization ability of model. To alleviate above limitations, in this paper, we propose a novel Siamese Sampling and Reasoning Network (SSRN) for TSG, which introduces a siamese sampling mechanism to generate additional contextual frames to enrich and refine the new boundaries. Specifically, a reasoning strategy is developed to learn the inter-relationship among these frames and generate soft labels on boundaries for more accurate frame-query reasoning. Such mechanism is also able to supplement the absent consecutive visual semantics to the sampled sparse frames for fine-grained activity understanding. Extensive experiments demonstrate the effectiveness of SSRN on three challenging datasets.